Multiple-Valued Tableaux with ∆-reductions
نویسنده
چکیده
We introduce the reduced signed logics which generalize previous approaches to signed logics in the sense that each variable is allowed to have its own set of semantic values. Reductions on both signed logics and signed formulas are used to describe improvements in tableau provers for MVLs. A labelled deductive system allows to use the implicit information in the formulas to describe improved expansion rules based on these reductions.
منابع مشابه
Bumping algorithm for set-valued shifted tableaux
We present an insertion algorithm of Robinson–Schensted type that applies to set-valued shifted Young tableaux. Our algorithm is a generalization of both set-valued non-shifted tableaux by Buch and non set-valued shifted tableaux by Worley and Sagan. As an application, we obtain a Pieri rule for a K-theoretic analogue of the Schur Q-functions. Résumé Nous présentons un algorithme d’insertion de...
متن کاملTableaus for many-valued modal logic
We continue a series of papers on a family of many-valued modal logics, a family whose Kripke semantics involves many-valued accessibility relations. Earlier papers in the series presented a motivation in terms of a multiple-expert semantics. They also proved completeness of sequent calculus formulations for the logics, formulations using a cut rule in an essential way. In this paper a novel cu...
متن کاملCombinatorial Hopf Algebras and K-Homology of Grassmanians
Motivated by work of Buch on set-valued tableaux in relation to the K-theory of the Grassmannian, we study six combinatorial Hopf algebras. These Hopf algebras can be thought of as K-theoretic analogues of the by now classical “square” of Hopf algebras consisting of symmetric functions, quasisymmetric functions, noncommutative symmetric functions and the Malvenuto-Reutenauer Hopf algebra of per...
متن کاملTowards an Efficient Tableau Proof Procedure for Multiple-Valued Logics
One of the obstacles against the use of tableau-based theorem provers for non-standard logics is the ineeciency of tableau systems in practical applications, though they are highly intuitive and extremely exible from a proof theoretical point of view. We present a method for increasing the eeciency of tableau systems in the case of multiple-valued logics by introducing a generalized notion of s...
متن کاملClassic-Like Analytic Tableaux for Finite-Valued Logics
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the object logic received as input should be sufficiently expressive, in having the appropriate linguistic resources that allow for a bivalent representation. For each logic, the tableau system obtained as output has some a...
متن کامل